A Hundred Impossibility Proofs for Distributed Computing Nancy A. Lynch * Lab for Computer Science MIT, Cambridge, MAlynchQtds.Ics.mit.edu

Source URL: groups.csail.mit.edu

• Concurrent computing
• Mathematical logic
• Fault-tolerant computer systems
• Concurrency control
• Edsger W. Dijkstra
• Computing
• Computer architecture
• Consensus
• Distributed computing
• Proof of impossibility
• Algorithm
• Mutual exclusion

Perspectives on the CAP Theorem Seth Gilbert National University of Singapore Nancy A. Lynch Massachusetts Institute of Technology

Source URL: groups.csail.mit.edu

Brewer’s Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services Seth Gilbert∗ Nancy Lynch∗

Source URL: www.glassbeam.com

Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Analysis of algorithms
• Theory of computation
• Mathematics
• Edsger W. Dijkstra
• Algorithm
• Mathematical logic
• Theoretical computer science
• Time complexity
• Shortest path problem
• Asymptotically optimal algorithm
• Randomized algorithm

Brewer’s Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services Seth Gilbert∗ Nancy Lynch∗

Source URL: www.comp.nus.edu.sg

• Transaction processing
• Computing
• Concurrent computing
• Data management
• Distributed computing
• ACID
• Consistency model
• Distributed shared memory
• Atomicity
• Consistency
• Consensus
• Shared register

A Hundred Impossibility Proofs for Distributed Computing Nancy A. Lynch * Lab for Computer Science MIT, Cambridge, MAlynchQtds.Ics.mit.edu

Source URL: groups.csail.mit.edu

• Fault-tolerant computer systems
• Mathematical logic
• Distributed computing
• Consensus
• Failure
• Theory of computation
• Proof of impossibility
• Algorithm
• Byzantine fault tolerance
• Parallel computing
• Shared register

Distributed Computation in Dynamic Networks Fabian Kuhn Nancy Lynch Rotem Oshman

Source URL: ac.informatik.uni-freiburg.de

Using Task-Structured PIOAs to Analyze Cryptographic Protocols Ran Canetti, Ling Cheung, Dilsun Kaynar, Moses Liskov, Nancy Lynch, Olivier Pereira and Roberto Segala March 5, 2006

Source URL: research.ihost.com

Broadcasting in Unreliable Radio Networks Fabian Kuhn Nancy Lynch Calvin Newport

Source URL: ac.informatik.uni-freiburg.de

Brewer’s Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services Seth Gilbert∗ Nancy Lynch∗

Source URL: www.comp.nus.edu.sg